State Recovery Attacks on Pseudorandom Generators
نویسندگان
چکیده
State recovery attacks comprise an important class of attacks on pseudorandom generators. In this paper we analyze resistance of pseudorandom generators against these attacks in terms of concrete security. We show that security of the BlumMicali pseudorandom generator against state recovery attacks is tightly related to the security of the corresponding one-way function. C. Wolf, S. Lucks, P.-W. Yau (Eds.): WEWoRC 2005, LNI P-74, pp. 53–63, 2005. c Gesellschaft für Informatik e.V.
منابع مشابه
Black-Box Assessment of Pseudorandom Algorithms
We present a survey of the non-cryptographic pseudorandom number generators provided to applications by a variety of highly prevalent platforms. Most of the pseudorandom number generators examined exhibit properties that enable various attacks and techniques, including forward and reverse prediction, seeking, and the recovery of internal state from pseudorandom application output many orders of...
متن کاملOn cryptographic properties of LFSR-based pseudorandom generators
Pseudorandom generators (PRGs) are used in modern cryptography to transform a small initial value into a long sequence of seemingly random bits. Many designs for PRGs are based on linear feedback shift registers (LFSRs), which can be constructed in such a way as to have optimal statistical and periodical properties. This thesis discusses construction principles and cryptanalytic attacks against...
متن کاملInferring Sequences Produced by Nonlinear Pseudorandom Number Generators Using Coppersmith's Methods
Number-theoretic pseudorandom generators work by iterating an algebraic map F (public or private) over a residue ring ZN on a secret random initial seed value v0 ∈ ZN to compute values vn+1 = F (vn) mod N for n ∈ N. They output some consecutive bits of the state value vn at each iteration and their efficiency and security are thus strongly related to the number of output bits. In 2005, Blackbur...
متن کاملComments on "a family of keystream generators with large linear complexity"
In thus work, a new class of keystream generators with a large hnear complexity has been derived The design crlterla are esslly compatible with those given m the hterature to prevent correlation attacks @ 2001 Elsevler Science Ltd All rights reserved Keywords-Cryptography, Information theory, Linear complexity, Pseudorandom sequence generators, Shift register
متن کاملCryptmt Version 2.0: a Large State Generator with Faster Initialization
As a pseudorandom number generator (PRNG) for a stream cipher, we propose a combination of (1) an F2-linear generator of a wordsizeinteger sequence with huge state space, and (2) a filter with one wordsize memory, based on the accumulative integer multiplication and extracting some most significant bits from the memory. We proposed CryptMT as an example. Merits of this type of generators are (1...
متن کامل